منابع مشابه
Références bibliographiques
In this study we measured the diameter of the competent long saphenous vein proximally and distally to the anastomosis of an isolated incompetent tributary in 12 patients. Measurements were made both before and 30-45 days after surgical removal of the tributary. The preoperative diameter of the saphenous vein proximal to the anastomosis was greater than distally. The difference between proximal...
متن کاملLa rétroconversion de fonds bibliographiques pour des besoins de bibliométrie
RÉSUMÉ. Cet article décrit une méthodologie de rétroconversion de citations permettant de retrouver les champs composants à partir de leur texte reconnu par OCR. Cette méthodologie se base à la fois sur la régularité et la redondance de certains champs ainsi que sur la localisation de parties de discours spécifiques à certains champs. Le résultat de la rétroconversion sert à des études de bibli...
متن کاملTherapeutic Orientations
In the past century, a number of psychotherapeutic orientations have gained popularity for treating mental illnesses. This module outlines some of the best-known therapeutic approaches and explains the history, techniques, advantages, and disadvantages associated with each. The most effective modern approach is cognitive behavioral therapy (CBT). We also discuss psychoanalytic therapy, personce...
متن کاملListing All st-Orientations
See examples in Fig. 1(b). Many graph algorithms use an st-orientation. For instance, graph drawing algorithms [3], [4], [17], [19], [22], routing algorithms [1], [13] and partitioning algorithms [14]. Given a biconnected graph G and its two vertices s and t, one can find an st-orientation of G in O(m + n) time [5], [6], [22]. Note that if G is not biconnected then G may have no st-orientation....
متن کاملOne-Way Trail Orientations
Given a graph, does there exist an orientation of the edges such that the resulting directed graph is strongly connected? Robbins’ theorem [Robbins, Am. Math. Monthly, 1939] states that such an orientation exists if and only if the graph is 2-edge connected. A natural extension of this problem is the following: Suppose that the edges of the graph is partitioned into trails. Can we orient the tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Littératures classiques
سال: 2013
ISSN: 0992-5279,2260-8478
DOI: 10.3917/licla.081.0281